Edification arrangement law

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Shi arrangement and the Ish arrangement

This paper is about two arrangements of hyperplanes. The first — the Shi arrangement — was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type A. The second — the Ish arrangement — was recently defined by the first author who used the two arrangements together to give a new interpretation of the q, t-Catalan numbers of Garsia and Haiman. In the prese...

متن کامل

On the Arrangement Graph

The arrangement graph was proposed as a generalization of the star graph topology. In this paper we investigate the topological properties of the (n, k)-arrangement graph &k. It has been shown that the (n, n 2)arrangement graph An,+2 is isomorphic to the n-alternating group graph AGn In addition, the exact value of average distance of A,,& has been derived.

متن کامل

Macromolecular arrangement within muscle.

Electron microscopy has already given much information about the macromolecular components of striated muscle (1, 4). Thus it is shown that myofibrils of teased muscle are ribbons composed of parallel arrays of filaments associated with an amount of seemingly amorphous material that is great,est in the anisotropic regions. For the present work, strips of psoas muscle separated from a rabbit at ...

متن کامل

Shi Threshold Arrangement

Richard Stanley suggested the problem of finding the characteristic polynomial of a certain hyperplane arrangement defined by xi + xj = 0, 1, which is called the Shi threshold arrangement. We present the answer of the problem, using the finite field method.

متن کامل

D-dimensional Arrangement Revisited

We revisit the d-dimensional arrangement problem and analyze the performance ratios of previously proposed algorithms based on the linear arrangement problem with d-dimensional cost. The two problems are related via space-filling curves and recursive balanced bipartitioning. We prove that the worst-case ratio of the optimum solutions of these problems is Θ(log n), where n is the number of verti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informes de la Construcción

سال: 2000

ISSN: 1988-3234,0020-0883

DOI: 10.3989/ic.2000.v51.i466.714